Non symmetric random walk on infinite graph
نویسندگان
چکیده
منابع مشابه
Symmetric Random Walk?)
Let Xk, k= 1, 2, 3, • • -, be a sequence of mutually independent random variables on an appropriate probability space which have a given common distribution function F. Let Sn = Xi+ • • • +Xn, then the event lim inf | S„\ = 0 has probability either zero or one. If this event has zero chance, we say F is transient; in the other case, | 5„| tends to infinity almost surely, and F is called recurre...
متن کاملThe mass of sites visited by a random walk on an infinite graph
We determine the log-asymptotic decay rate of the negative exponential moments of the mass of sites visited by a random walk on an infinite graph which satisfies a two-sided sub-Gaussian estimate on its transition kernel. This provides a new method of proof of the correct decay rate for Cayley graphs of finitely generated groups with polynomial volume growth. This method also extend known resul...
متن کاملFast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it suffers from the expensive computational cost which is at least O(n) or O(m) for graphs with n nodes and m edges. In this paper, we propose Ark, a set of fast algorithms for random walk graph kernel computation. Ark is...
متن کاملRandom walk on the incipient infinite cluster on trees
Let G be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree n0 +1. We obtain estimates for the transition density of the the continuous time simple random walk Y on G; the process satisfies anomalous diffusion and has spectral dimension 4 3 . 2000 MSC. Primary 60K37; Secondary 60J80, 60J35.
متن کاملRandom Infinite Permutations and the Cyclic Time Random Walk
The random stirring process is a natural random walk on the set of permutations of the vertex set of a graph. The cyclic time random walk is a self interacting random walk on a graph. It is influenced by its past, in that it is constrained to repeat its past choices if it returns to a previously visited edge after a multiple of some period of time. The two models are fundamentally equivalent to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2011
ISSN: 1232-9274
DOI: 10.7494/opmath.2011.31.4.669